Multiple domination models for placement of electric vehicle charging stations in road networks

Electric and hybrid vehicles play an increasing role in the road transport networks. Despite their advantages, they have a relatively limited cruising range in comparison to traditional diesel/petrol vehicles, and require significant battery charging time. We propose to model the facility location problem of the placement of charging stations in road networks as a multiple domination problem on reachability graphs. This model takes into consideration natural assumptions such as a threshold for remaining battery load, and provides some minimal choice for a travel direction to recharge the battery. Experimental evaluation and simulations for the proposed facility location model are presented in the case of real road networks corresponding to the cities of Boston and Dublin.Comment: 20 pages, 5 figures; Original version from March-April 201

An end-to-end graph convolutional kernel support vector machine

A novel kernel-based support vector machine (SVM) for graph classification is proposed. The SVM feature space mapping consists of a sequence of graph convolutional layers, which generates a vector space representation for each vertex, followed by a pooling layer which generates a reproducing kernel Hilbert space (RKHS) representation for the graph. The use of a RKHS offers the ability to implicitly operate in this space using a kernel function without the computational complexity of explicitly mapping into it. The proposed model is trained in a supervised end-to-end manner whereby the convolutional layers, the kernel function and SVM parameters are jointly optimized with respect to a regularized classification loss. This approach is distinct from existing kernel-based graph classification models which instead either use feature engineering or unsupervised learning to define the kernel function. Experimental results demonstrate that the proposed model outperforms existing deep learning baseline models on a number of datasets

Analysis of interaction and co-editing patterns amongst OpenStreetMap contributors

OpenStreetMap (OSM) is a very well known and popular Volunteered Geographic Information (VGI) project on the Internet. In January 2013 OSM gained its one millionth registered member. Several studies have shown that only a small percentage of these registered members carry out the large majority of the mapping and map editing work. In this article we discuss results from a social-network based analysis of seven major cities in OSM in an effort to understand if there is quantitative evidence of interaction and collaboration between OSM members in these areas. Are OSM contributors working on their own to build OSM databases in these cities or is there evidence of collaboration between OSM contributors? We find that in many cases high frequent contributors (“senior mappers”) perform very large amounts of mapping work on their own but do interact (edit/update) contributions from lower frequency contributors

Integrating Volunteered Geographic Information into Pervasive Health Computing Applications

In this paper we describe the potential for using Volunteered Geographic Information (VGI) in pervasive health computing. We use the OpenStreetMap project as a case-study of a successful VGI project and investigate how it can be expanded and used as a source of spatial information for pervasive computing technologies particularly in the area of access to information on healthcare services

Spatio-temporal modeling of the topology of swarm behavior with persistence landscapes

We propose a method for modeling the topology of swarm behavior in a manner which facilitates the application of machine learning techniques such as clustering. This is achieved by modeling the persistence of topological features, such as connected components and holes, of the swarm with respect to time using zig-zag persistent homology. The output of this model is subsequently transformed into a representation known as a persistence landscape. This representation forms a vector space and therefore facilitates the application of machine learning techniques. The proposed model is validated using a real data set corresponding to a swarm of 300 fish. We demonstrate that it may be used to perform clustering of swarm behavior with respect to topological features

Stability and statistical inferences in the space of topological spatial relationships

Modelling topological properties of the spatial relationship between objects, known as the extit{topological relationship}, represents a fundamental research problem in many domains including Artificial Intelligence (AI) and Geographical Information Science (GIS). Real world data is generally finite and exhibits uncertainty. Therefore, when attempting to model topological relationships from such data it is useful to do so in a manner which is both extit{stable} and facilitates extit{statistical inferences}. Current models of the topological relationships do not exhibit either of these properties. We propose a novel model of topological relationships between objects in the Euclidean plane which encodes topological information regarding connected components and holes. Specifically, a representation of the persistent homology, known as a persistence scale space, is used. This representation forms a Banach space that is stable and, as a consequence of the fact that it obeys the strong law of large numbers and the central limit theorem, facilitates statistical inferences. The utility of this model is demonstrated through a number of experiments

Modelling topological features of swarm behaviour in space and time with persistence landscapes

This paper presents a model of swarm behaviour that encodes the spatial-temporal characteristics of topological features such as holes and connected components. Specifically, the persistence of topological features with respect to time are computed using zig-zag persistent homology. This information is in turn modelled as a persistence landscape which forms a normed vector space and facilitates the application of statistical and data mining techniques. Validation of the proposed model is performed using a real data set corresponding to a swarm of fish. It is demonstrated that the proposed model may be used to perform retrieval and clustering of swarm behaviour in terms of topological features. In fact, it is discovered that clustering returns clusters corresponding to the swarm behaviours of flock, torus and disordered. These are the most frequently occurring types of behaviour exhibited by swarms in general

Removing the texture feature response to object boundaries

Texture is a spatial property and thus any features used to describe it must be calculated within a neighbourhood. This process of integrating information over a neighbourhood leads to what we will refer to as the texture boundary response problem, where an unwanted response is observed at object boundaries. This response is due to features being extracted from a mixture of textures and/or an intensity edge between objects. If segmentation is performed using these raw features this will lead to the generation of unwanted classes along object boundaries. To overcome this, post processing of feature images must be performed to remove this response before a classification algorithm can be applied. To date this problem has received little attention with no evaluation of the alternative solutions available in the literature of which we are aware. In this work we perform an evaluation of known solutions to the boundary response problem and discover separable median filtering to be the curre nt best choice. An in depth evaluation of the separable median filtering approach shows that it fails to remove certain parts or types of object boundary response. To overcome this failing we propose two alternative techniques which involve either post processing of the separable median filtered result or an alternative filtering technique

Linear street extraction using a Conditional Random Field model

A novel method for extracting linear streets from a street network is proposed where a linear street is defined as a sequence of connected street segments having a shape similar to a straight line segment. Specifically a given street network is modeled as a Conditional Random Field (CRF) where the task of extracting linear streets corresponds to performing learning and inference with respect to this model. The energy function of the proposed CRF model is submodular and consequently exact inference can be performed in polynomial time. This contrasts with traditional solutions to the problem of extracting linear streets which employ heuristic search procedures and cannot guarantee that the optimal solution will be found. The performance of the proposed method is quantified in terms of identifying those types or classes of streets which generally exhibit the characteristic of being linear. Results achieved on a large evaluation dataset demonstrate that the proposed method greatly outperforms the aforementioned traditional solutions